TSTP Solution File: PRO029^16 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PRO029^16 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:10:18 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 29
% Syntax : Number of formulae : 73 ( 24 unt; 16 typ; 0 def)
% Number of atoms : 188 ( 10 equ; 0 cnn)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 458 ( 63 ~; 50 |; 12 &; 311 @)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 40 ( 40 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 75 ( 24 ^ 51 !; 0 ?; 75 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mindex: $tType ).
thf(decl_sort2,type,
mworld: $tType ).
thf(decl_22,type,
mrel: mindex > mworld > mworld > $o ).
thf(decl_23,type,
'#c': mindex ).
thf(decl_24,type,
'#u': mindex ).
thf(decl_25,type,
mactual: mworld ).
thf(decl_26,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_27,type,
mnot: ( mworld > $o ) > mworld > $o ).
thf(decl_28,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_30,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_32,type,
mbox: mindex > ( mworld > $o ) > mworld > $o ).
thf(decl_34,type,
charge: mworld > $o ).
thf(decl_35,type,
called: mworld > $o ).
thf(decl_36,type,
paid: mworld > $o ).
thf(decl_37,type,
esk1_1: mworld > mworld ).
thf(decl_39,type,
esk3_0: mworld ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NYfKoUtXfe/E---3.1_5604.p',mlocal_def) ).
thf(mand_def,axiom,
( mand
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
& ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NYfKoUtXfe/E---3.1_5604.p',mand_def) ).
thf(mimplies_def,axiom,
( mimplies
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NYfKoUtXfe/E---3.1_5604.p',mimplies_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X5: mindex,X1: mworld > $o,X3: mworld] :
! [X6: mworld] :
( ( mrel @ X5 @ X3 @ X6 )
=> ( X1 @ X6 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NYfKoUtXfe/E---3.1_5604.p',mbox_def) ).
thf(mnot_def,axiom,
( mnot
= ( ^ [X2: mworld > $o,X3: mworld] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NYfKoUtXfe/E---3.1_5604.p',mnot_def) ).
thf(axiom_charge_u,axiom,
mlocal @ ( mimplies @ charge @ ( mand @ ( mbox @ '#u' @ charge ) @ ( mbox @ '#c' @ charge ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NYfKoUtXfe/E---3.1_5604.p',axiom_charge_u) ).
thf(requirement_1,conjecture,
mlocal @ ( mimplies @ ( mnot @ ( mimplies @ charge @ ( mand @ called @ ( mnot @ paid ) ) ) ) @ ( mbox @ '#u' @ ( mnot @ ( mimplies @ charge @ ( mand @ called @ ( mnot @ paid ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NYfKoUtXfe/E---3.1_5604.p',requirement_1) ).
thf(axiom_2,axiom,
mlocal @ ( mbox @ '#c' @ ( mimplies @ paid @ ( mbox @ '#u' @ paid ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NYfKoUtXfe/E---3.1_5604.p',axiom_2) ).
thf('mrel_#c_reflexive',axiom,
! [X3: mworld] : ( mrel @ '#c' @ X3 @ X3 ),
file('/export/starexec/sandbox/tmp/tmp.NYfKoUtXfe/E---3.1_5604.p','mrel_#c_reflexive') ).
thf('mrel_#u_transitive',axiom,
! [X3: mworld,X6: mworld,X7: mworld] :
( ( ( mrel @ '#u' @ X3 @ X6 )
& ( mrel @ '#u' @ X6 @ X7 ) )
=> ( mrel @ '#u' @ X3 @ X7 ) ),
file('/export/starexec/sandbox/tmp/tmp.NYfKoUtXfe/E---3.1_5604.p','mrel_#u_transitive') ).
thf('mrel_#u_reflexive',axiom,
! [X3: mworld] : ( mrel @ '#u' @ X3 @ X3 ),
file('/export/starexec/sandbox/tmp/tmp.NYfKoUtXfe/E---3.1_5604.p','mrel_#u_reflexive') ).
thf(axiom_3,axiom,
mlocal @ ( mimplies @ ( mnot @ ( mbox @ '#c' @ called ) ) @ ( mbox @ '#u' @ ( mnot @ ( mbox @ '#c' @ called ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NYfKoUtXfe/E---3.1_5604.p',axiom_3) ).
thf(axiom_1,axiom,
mlocal @ ( mbox @ '#u' @ ( mimplies @ called @ ( mbox @ '#c' @ called ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NYfKoUtXfe/E---3.1_5604.p',axiom_1) ).
thf(c_0_13,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_14,plain,
( mand
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand_def]) ).
thf(c_0_15,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_16,plain,
( mbox
= ( ^ [Z0: mindex,Z1: mworld > $o,Z2: mworld] :
! [X6: mworld] :
( ( mrel @ Z0 @ Z2 @ X6 )
=> ( Z1 @ X6 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_17,plain,
( mnot
= ( ^ [Z0: mworld > $o,Z1: mworld] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot_def]) ).
thf(c_0_18,plain,
( ( charge @ mactual )
=> ( ! [X16: mworld] :
( ( mrel @ '#u' @ mactual @ X16 )
=> ( charge @ X16 ) )
& ! [X17: mworld] :
( ( mrel @ '#c' @ mactual @ X17 )
=> ( charge @ X17 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_charge_u,c_0_13]),c_0_14]),c_0_15]),c_0_16]) ).
thf(c_0_19,negated_conjecture,
~ ( ~ ( ( charge @ mactual )
=> ( ( called @ mactual )
& ~ ( paid @ mactual ) ) )
=> ! [X28: mworld] :
( ( mrel @ '#u' @ mactual @ X28 )
=> ~ ( ( charge @ X28 )
=> ( ( called @ X28 )
& ~ ( paid @ X28 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[requirement_1]),c_0_13]),c_0_17]),c_0_14]),c_0_15]),c_0_16])]) ).
thf(c_0_20,plain,
! [X37: mworld,X38: mworld] :
( ( ~ ( mrel @ '#u' @ mactual @ X37 )
| ( charge @ X37 )
| ~ ( charge @ mactual ) )
& ( ~ ( mrel @ '#c' @ mactual @ X38 )
| ( charge @ X38 )
| ~ ( charge @ mactual ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])]) ).
thf(c_0_21,negated_conjecture,
( ( charge @ mactual )
& ( ~ ( called @ mactual )
| ( paid @ mactual ) )
& ( mrel @ '#u' @ mactual @ esk3_0 )
& ( ( called @ esk3_0 )
| ~ ( charge @ esk3_0 ) )
& ( ~ ( paid @ esk3_0 )
| ~ ( charge @ esk3_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])]) ).
thf(c_0_22,plain,
! [X21: mworld] :
( ( mrel @ '#c' @ mactual @ X21 )
=> ( ( paid @ X21 )
=> ! [X20: mworld] :
( ( mrel @ '#u' @ X21 @ X20 )
=> ( paid @ X20 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_2,c_0_13]),c_0_15]),c_0_16]) ).
thf(c_0_23,plain,
! [X3: mworld] :
( ( charge @ X3 )
| ~ ( mrel @ '#u' @ mactual @ X3 )
| ~ ( charge @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_24,negated_conjecture,
charge @ mactual,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_25,plain,
! [X41: mworld,X42: mworld] :
( ~ ( mrel @ '#c' @ mactual @ X41 )
| ~ ( paid @ X41 )
| ~ ( mrel @ '#u' @ X41 @ X42 )
| ( paid @ X42 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
thf(c_0_26,plain,
! [X29: mworld] : ( mrel @ '#c' @ X29 @ X29 ),
inference(variable_rename,[status(thm)],['mrel_#c_reflexive']) ).
thf(c_0_27,plain,
! [X34: mworld,X35: mworld,X36: mworld] :
( ~ ( mrel @ '#u' @ X34 @ X35 )
| ~ ( mrel @ '#u' @ X35 @ X36 )
| ( mrel @ '#u' @ X34 @ X36 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['mrel_#u_transitive'])])]) ).
thf(c_0_28,plain,
! [X3: mworld] :
( ( charge @ X3 )
| ~ ( mrel @ '#u' @ mactual @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
thf(c_0_29,negated_conjecture,
mrel @ '#u' @ mactual @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_30,plain,
! [X3: mworld,X6: mworld] :
( ( paid @ X6 )
| ~ ( mrel @ '#c' @ mactual @ X3 )
| ~ ( paid @ X3 )
| ~ ( mrel @ '#u' @ X3 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_31,plain,
! [X3: mworld] : ( mrel @ '#c' @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_32,plain,
! [X3: mworld,X6: mworld,X7: mworld] :
( ( mrel @ '#u' @ X3 @ X7 )
| ~ ( mrel @ '#u' @ X3 @ X6 )
| ~ ( mrel @ '#u' @ X6 @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_33,plain,
! [X33: mworld] : ( mrel @ '#u' @ X33 @ X33 ),
inference(variable_rename,[status(thm)],['mrel_#u_reflexive']) ).
thf(c_0_34,negated_conjecture,
( ~ ( paid @ esk3_0 )
| ~ ( charge @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_35,negated_conjecture,
charge @ esk3_0,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_36,plain,
( ~ ! [X22: mworld] :
( ( mrel @ '#c' @ mactual @ X22 )
=> ( called @ X22 ) )
=> ! [X24: mworld] :
( ( mrel @ '#u' @ mactual @ X24 )
=> ~ ! [X23: mworld] :
( ( mrel @ '#c' @ X24 @ X23 )
=> ( called @ X23 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_3,c_0_13]),c_0_17]),c_0_15]),c_0_16]) ).
thf(c_0_37,plain,
! [X3: mworld] :
( ( paid @ X3 )
| ~ ( mrel @ '#u' @ mactual @ X3 )
| ~ ( paid @ mactual ) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
thf(c_0_38,negated_conjecture,
! [X3: mworld] :
( ( mrel @ '#u' @ X3 @ esk3_0 )
| ~ ( mrel @ '#u' @ X3 @ mactual ) ),
inference(spm,[status(thm)],[c_0_32,c_0_29]) ).
thf(c_0_39,plain,
! [X3: mworld] : ( mrel @ '#u' @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
thf(c_0_40,negated_conjecture,
~ ( paid @ esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
thf(c_0_41,plain,
! [X19: mworld] :
( ( mrel @ '#u' @ mactual @ X19 )
=> ( ( called @ X19 )
=> ! [X18: mworld] :
( ( mrel @ '#c' @ X19 @ X18 )
=> ( called @ X18 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_1,c_0_13]),c_0_15]),c_0_16]) ).
thf(c_0_42,plain,
! [X43: mworld,X44: mworld] :
( ( ( mrel @ '#c' @ X44 @ ( esk1_1 @ X44 ) )
| ~ ( mrel @ '#u' @ mactual @ X44 )
| ~ ( mrel @ '#c' @ mactual @ X43 )
| ( called @ X43 ) )
& ( ~ ( called @ ( esk1_1 @ X44 ) )
| ~ ( mrel @ '#u' @ mactual @ X44 )
| ~ ( mrel @ '#c' @ mactual @ X43 )
| ( called @ X43 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])])])]) ).
thf(c_0_43,negated_conjecture,
~ ( paid @ mactual ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]),c_0_40]) ).
thf(c_0_44,negated_conjecture,
( ( paid @ mactual )
| ~ ( called @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_45,plain,
! [X39: mworld,X40: mworld] :
( ~ ( mrel @ '#u' @ mactual @ X39 )
| ~ ( called @ X39 )
| ~ ( mrel @ '#c' @ X39 @ X40 )
| ( called @ X40 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])])]) ).
thf(c_0_46,plain,
! [X3: mworld,X6: mworld] :
( ( mrel @ '#c' @ X3 @ ( esk1_1 @ X3 ) )
| ( called @ X6 )
| ~ ( mrel @ '#u' @ mactual @ X3 )
| ~ ( mrel @ '#c' @ mactual @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
thf(c_0_47,negated_conjecture,
~ ( called @ mactual ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
thf(c_0_48,plain,
! [X3: mworld,X6: mworld] :
( ( called @ X6 )
| ~ ( called @ ( esk1_1 @ X3 ) )
| ~ ( mrel @ '#u' @ mactual @ X3 )
| ~ ( mrel @ '#c' @ mactual @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
thf(c_0_49,plain,
! [X3: mworld,X6: mworld] :
( ( called @ X6 )
| ~ ( mrel @ '#u' @ mactual @ X3 )
| ~ ( called @ X3 )
| ~ ( mrel @ '#c' @ X3 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
thf(c_0_50,plain,
! [X3: mworld] :
( ( mrel @ '#c' @ X3 @ ( esk1_1 @ X3 ) )
| ~ ( mrel @ '#u' @ mactual @ X3 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_31]),c_0_47]) ).
thf(c_0_51,plain,
! [X3: mworld] :
( ( called @ mactual )
| ~ ( mrel @ '#u' @ mactual @ X3 )
| ~ ( called @ ( esk1_1 @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_48,c_0_31]) ).
thf(c_0_52,plain,
! [X3: mworld] :
( ( called @ ( esk1_1 @ X3 ) )
| ~ ( mrel @ '#u' @ mactual @ X3 )
| ~ ( called @ X3 ) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
thf(c_0_53,negated_conjecture,
( ( called @ esk3_0 )
| ~ ( charge @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_54,plain,
! [X3: mworld] :
( ~ ( mrel @ '#u' @ mactual @ X3 )
| ~ ( called @ X3 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_47]) ).
thf(c_0_55,negated_conjecture,
called @ esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_35])]) ).
thf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_38]),c_0_55]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PRO029^16 : TPTP v8.1.2. Released v8.1.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 15:47:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running higher-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.NYfKoUtXfe/E---3.1_5604.p
% 0.21/0.52 # Version: 3.1.0-ho
% 0.21/0.52 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.52 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.52 # Starting post_as_ho11 with 300s (1) cores
% 0.21/0.52 # Starting full_lambda_8 with 300s (1) cores
% 0.21/0.52 # post_as_ho11 with pid 5711 completed with status 0
% 0.21/0.52 # Result found by post_as_ho11
% 0.21/0.52 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.52 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.52 # Starting post_as_ho11 with 300s (1) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: HGHNS-FFSF11-SHSSMFNN
% 0.21/0.52 # partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.52 # new_ho_10 with pid 5721 completed with status 0
% 0.21/0.52 # Result found by new_ho_10
% 0.21/0.52 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.52 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.52 # Starting post_as_ho11 with 300s (1) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: HGHNS-FFSF11-SHSSMFNN
% 0.21/0.52 # partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 36
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 35
% 0.21/0.52 # Removed in clause preprocessing : 17
% 0.21/0.52 # Initial clauses in saturation : 18
% 0.21/0.52 # Processed clauses : 59
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 1
% 0.21/0.52 # ...remaining for further processing : 58
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 10
% 0.21/0.52 # Backward-rewritten : 2
% 0.21/0.52 # Generated clauses : 54
% 0.21/0.52 # ...of the previous two non-redundant : 44
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 54
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 22
% 0.21/0.52 # ...of those cached : 17
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 28
% 0.21/0.52 # Positive orientable unit clauses : 8
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 3
% 0.21/0.52 # Non-unit-clauses : 17
% 0.21/0.52 # Current number of unprocessed clauses: 15
% 0.21/0.52 # ...number of literals in the above : 48
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 30
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 47
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 42
% 0.21/0.52 # Non-unit clause-clause subsumptions : 8
% 0.21/0.52 # Unit Clause-clause subsumption calls : 15
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 4
% 0.21/0.52 # BW rewrite match successes : 1
% 0.21/0.52 # Condensation attempts : 59
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 3663
% 0.21/0.52 # Search garbage collected termcells : 831
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.007 s
% 0.21/0.52 # System time : 0.004 s
% 0.21/0.52 # Total time : 0.011 s
% 0.21/0.52 # Maximum resident set size: 1908 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.009 s
% 0.21/0.52 # System time : 0.006 s
% 0.21/0.52 # Total time : 0.015 s
% 0.21/0.52 # Maximum resident set size: 1776 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------